Applications of interval arithmetic in solving polynomial equations by Wu’s elimination method

نویسندگان

  • CHEN Falai
  • YANG Wu
چکیده

Wu’s elimination method is an important method for solving multivariate polynomial equations. In this paper, we apply interval arithmetic to Wu’s method and convert the problem of solving polynomial equations into that of solving interval polynomial equations. Parallel results such as zero-decomposition theorem are obtained for interval polynomial equations. The advantages of the new approach are two-folds: First, the problem of the numerical instability arisen from floating-point arithmetic is largely overcome. Second, the low efficiency of the algorithm caused by large intermediate coefficients introduced by exact compaction is dramatically improved. Some examples are provided to illustrate the effectiveness of the proposed algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving multivariate polynomial systems using hyperplane arithmetic and linear programming

Solving polynomial systems of equations is an important problem in many fields such as computer-aided design and manufacturing [1] and robotics [2]. In recent years, subdivision-based solvers, which typically make use of the properties of the Bézier / B-spline representation, have proven successful in solving such systems of polynomial constraints [3, 4, 5]. A major drawback in using subdivisio...

متن کامل

On Solving Systems of Equations Using Interval Arithmetic

Introduction. In this paper, we consider the problem of applying interval arithmetic to bound a solution of a system of nonlinear equations. Moore [1, Section 7.3] has discussed the same problem. His approach, as well as ours, is to extend the multidimensional Newton method and implement it in interval arithmetic. In Section 2, it is shown that a particular detail of Moore's method can be modif...

متن کامل

An introduction to interval-based constraint processing

Constraint programming is often associated with solving problems over finite domains. Many applications in engineering, CAD and design, however, require solving problems over continuous (real-valued) domains. While simple constraint solvers can solve linear constraints with the inaccuracy of floating-point arithmetic, methods based on interval arithmetic allow exact (interval) solutions over a ...

متن کامل

Solving Polynomial Systems Using a Modified Line Search Approach

This paper proposes a modified line search technique for solving systems of complex nonlinear equations. Line search is a widely used iterative global search method. Since optimization strategies have been (and continue to be) successfully used for solving systems of nonlinear equations, the system is reduced to a one-dimensional equation system for optimization purpose. The proposed line searc...

متن کامل

THE USE OF THE HE'S ITERATION METHOD FOR SOLVING NONLINEAR EQUATIONS USING CADNA LIBRARY

In this paper, we apply the Newton’s and He’s iteration formulas in order to solve the nonlinear algebraic equations. In this case, we use the stochastic arithmetic and the CESTAC method to validate the results. We show that the He’s iteration formula is more reliable than the Newton’s iteration formula by using the CADNA library.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005